On equations and first-order theory of one-relator monoids
نویسندگان
چکیده
We investigate systems of equations and the first-order theory one-relator monoids. describe a family F monoids form 〈A|w=1〉 where for each monoid M in F, longstanding open problem decidability word with length constraints reduces to Diophantine (i.e. equations) M. achieve this result by finding an interpretation free monoid, using only together relations. It follows that has undecidable positive AE-theory, hence particular it theory. The includes many torsion 〈A|wn=1〉 (n>1). In contrast, all groups are hyperbolic, hyperbolic known have decidable problem. further different class
منابع مشابه
On One-relator Inverse Monoids and One-relator Groups
It is known that the word problem for one-relator groups and for one-relator monoids of the form Mon〈A ‖ w = 1〉 is decidable. However, the question of decidability of the word problem for general one-relation monoids of the form M = Mon〈A ‖ u = v〉 where u and v are arbitrary (positive) words in A remains open. The present paper is concerned with one-relator inverse monoids with a presentation o...
متن کاملDivisibility problem for one relator monoids
Theorem 1 The word problem for any 1-relator monoids can be reduced to the left side divisibility problem for monoids M presented in 2 generators by 1 defining relation of the form aU = bV . For the solution of this problem it sufficies to find an algorithm to recognize for any word aW (or for any word bW ) whether or not it is left side divisible in M by the letter b (accordingly by the letter...
متن کاملFirst order linear fuzzy dynamic equations on time scales
In this paper, we study the concept of generalized differentiability for fuzzy-valued functions on time scales. Usingthe derivative of the product of two functions, we provide solutions to first order linear fuzzy dynamic equations. Wepresent some examples to illustrate our results.
متن کاملOn the Theory of One-Step Rewriting in Trace Monoids
We prove that the first-order theory of the one-step rewriting relation associated with a trace rewriting system is decidable and give a nonelementary lower bound for the complexity. The decidability extends known results on semi-Thue systems but our proofs use new methods; these new methods yield the decidability of local properties expressed in first-order logic augmented by modulo-counting q...
متن کاملThe Word Problem for Inverse Monoids Presented by One Idempotent Relator
Birget, J.-C., SW. Margolis and J.C. Meakin, The word problem for inverse monoids presented by one idempotent relator, Theoretical Computer Science 123 (1994) 2733289. We study inverse monoids presented by a finite set of generators and one relation e= I, where e is a word representing an idempotent in the free inverse monoid, and 1 is the empty word. We show that (1) the word problem is solvab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information & Computation
سال: 2021
ISSN: ['0890-5401', '1090-2651']
DOI: https://doi.org/10.1016/j.ic.2021.104745